Random walks on graphs with volume and time doubling
نویسندگان
چکیده
منابع مشابه
Random walks on graphs with volume and time doubling∗
This paper studies the onand off-diagonal upper estimate and the two-sided transition probability estimate of random walks on weighted graphs.
متن کاملRandom Walks on Random Graphs
The aim of this article is to discuss some of the notions and applications of random walks on finite graphs, especially as they apply to random graphs. In this section we give some basic definitions, in Section 2 we review applications of random walks in computer science, and in Section 3 we focus on walks in random graphs. Given a graphG = (V,E), let dG(v) denote the degree of vertex v for all...
متن کاملRandom walks on graphs
Let G = (V,E) be a connected, undirected graph. We shall consider the following model of a random walk on G. The walk starts out at time 0 in some initial distribution on the vertex set V ; the initial condition may be deterministic, which corresponds to the distribution assigning probability 1 to a single vertex. The random walk is constructed as follows. There are independent unit rate Poisso...
متن کاملDiscrete-time random walks on diagrams (graphs) with cycles.
After a review of the diagram method for continuous-time random walks on graphs with cycles, the method is extended to discrete-time random walks. The basic theorems carry over formally from continuous time to discrete time. Three problems in tennis probabilities are used to illustrate random walks on discrete-time diagrams with cycles.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Revista Matemática Iberoamericana
سال: 2006
ISSN: 0213-2230
DOI: 10.4171/rmi/448